Misfortunes of a mathematicians' trio using Computer Algebra Systems: Can we trust?

نویسندگان

  • Antonio J. Durán Guardeño
  • Mario Pérez
  • Juan Luis Varona
چکیده

Computer algebra systems are a great help for mathematical research but sometimes unexpected errors in the software can also badly affect it. As an example, we show how we have detected an error of Mathematica computing determinants of matrices of integer numbers: not only it computes the determinants wrongly, but also it produces different results if one evaluates the same determinant twice. MSC Numbers: 68W30 Introduction Nowadays mathematicians often use computer algebra systems as an assistant in their mathematical research. Mathematicians have the ideas, and tedious computations are left to the computer. Everybody “knows” that computers perform this work better than persons. But, of course, we must trust in the results derived by the powerful computer algebra systems that we use. Currently we are using Mathematica to find examples and counterexamples of some mathematical results that we are working out, with the aim of finding the correct hypothesis and later to build a mathematical proof. Our goal was to improve some results by Karlin and Szegő [4] related to orthogonal polynomials on the real line. Details are not important, and this is just an example of the use of a computer algebra system by a typical mathematician in research, but let us explain it briefly; it is not necessary to completely understand it, just to see that it was a typical mathematical research with computer algebra as a tool. Our starting point is a discrete positive measure on the real line μ = ∑ n≥0 Mnδan (where δa denotes a Dirac delta in a, and an < an+1), having a sequence of orthogonal polynomials {Pn}n≥0 (where Pn has degree n and positive leading coefficient). Karlin and Szegő considered in 1961 (see [4]) the l × l Casorati determinants det 

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Beyond the black box

As developers of SageMath, we show how open software facilitates corrections. “Commercial computer algebra systems are black boxes, and their algorithms are opaque to the users,” complained a trio ofmathematicianswhose “misfortunes” are detailed in a recent Notices article [2]. “We reported the bug on October 7, 2013...By June 2014, nothing had changed ...All we could do was wait.”

متن کامل

Merging Similarity and Trust Based Social Networks to Enhance the Accuracy of Trust-Aware Recommender Systems

In recent years, collaborative filtering (CF) methods are important and widely accepted techniques are available for recommender systems. One of these techniques is user based that produces useful recommendations based on the similarity by the ratings of likeminded users. However, these systems suffer from several inherent shortcomings such as data sparsity and cold start problems. With the dev...

متن کامل

DisTriB: Distributed Trust Management Model Based on Gossip Learning and Bayesian Networks in Collaborative Computing Systems

The interactions among peers in Peer-to-Peer systems as a distributed collaborative system are based on asynchronous and unreliable communications. Trust is an essential and facilitating component in these interactions specially in such uncertain environments. Various attacks are possible due to large-scale nature and openness of these systems that affects the trust. Peers has not enough inform...

متن کامل

NETS AND SEPARATED S-POSETS

Nets, useful topological tools, used to generalize certainconcepts that may only be general enough in the context of metricspaces. In this work we introduce this concept in an $S$-poset, aposet with an action of a posemigroup $S$ on it whichis a very useful structure in computer sciences and interestingfor mathematicians, and give the the concept of $S$-net. Using $S$-nets and itsconvergency we...

متن کامل

DisTriB: Distributed Trust Management Model Based on Gossip Learning and Bayesian Networks in Collaborative Computing Systems

The interactions among peers in Peer-to-Peer systems as a distributed collaborative system are based on asynchronous and unreliable communications. Trust is an essential and facilitating component in these interactions specially in such uncertain environments. Various attacks are possible due to large-scale nature and openness of these systems that affects the trust. Peers has not enough inform...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1312.3270  شماره 

صفحات  -

تاریخ انتشار 2013